The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices

نویسنده

  • Gábor Czédli
چکیده

For subnormal subgroups A / B and C / D of a given group G, the factor B/A will be called subnormally down-and-up projective to D/C, if there are subnormal subgroups X /Y such that AY = B, A∩Y = X , CY = D and C∩Y = X . Clearly, B/A ∼= D/C in this case. As G. Grätzer and J.B. Nation [6] have just pointed out, the standard proof of the classical Jordan-Hölder theorem yields somewhat more than widely known; namely, the factors of any two given composition series are the same up to subnormal down-and-up projectivity and a permutation. We prove the uniqueness of this permutation. The main result is the analogous statement for semimodular lattices. Most of the paper belongs to pure lattice theory; the group theoretical part is only a simple reference to a classical theorem of H. Wielandt [14].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Frankl's Conjecture for a subclass of semimodular lattices

 In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...

متن کامل

Composition Series in Groups and the Structure of Slim Semimodular Lattices

Let ~ H and ~ K be finite composition series of a group G. The intersections Hi ∩ Kj of their members form a lattice CSL( ~ H, ~ K) under set inclusion. Improving the Jordan-Hölder theorem, G. Grätzer, J.B. Nation and the present authors have recently shown that ~ H and ~ K determine a unique permutation π such that, for all i, the i-th factor of ~ H is “down-and-up projective” to the π(i)-th f...

متن کامل

Semimodular Lattices and Semibuildings

In a ranked lattice, we consider two maximal chains, or “flags” to be i-adjacent if they are equal except possibly on rank i . Thus, a finite rank lattice is a chamber system. If the lattice is semimodular, as noted in [9], there is a “Jordan-Hölder permutation” between any two flags. This permutation has the properties of an Sn-distance function on the chamber system of flags. Using these noti...

متن کامل

Minimal Paths between Maximal Chains in Finite Rank Semimodular Lattices

We study paths between maximal chains, or “flags,” in finite rank semimodular lattices. Two flags are adjacent if they differ on at most one rank. A path is a sequence of flags in which consecutive flags are adjacent. We study the union of all flags on at least one minimum length path connecting two flags in the lattice. This is a subposet of the original lattice. If the lattice is modular, the...

متن کامل

Finite Lattices and Jordan-holder Sets 1)

In this paper we extend some aspects of the theory of 'supersolvable lattices' [3] to a more general class of finite lattices which includes the upper-semimodular lattices. In particular, all conjectures made in [33 concerning upper-semimodular lattices will be proved. For instance, we will prove that if L is finite upper-semimodular and if L' denotes L with any set of 'levels' removed, then th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010